On the membership problem for regular DNLC grammars

AbstractThere are (at least) three motivations to study the class of regular directed node-label controlled graph grammars (regular DNLC grammars for shor): (1) it fits very well into the hierarchy of subclasses of DNLC grammars, (2) it generalizes naturally right-linear string grammars and (3) it provides a useful framework for the theory of concurrent systems based on the theory of traces.The complexity of (the membership problem for) the class of regular DNLC grammars is investigated

CTS systems and Petri nets

AbstractThe general theory of coordinated table selective substitution systems (cts systems for short) (see Rozenberg (1985)), provides a unifying framework for a considerable number of grammar and automaton models considered in the literature. This paper is mainly devoted to the investigation of a natural subclass of cts systems (which uses the ‘context-free grammar selector’ for its memory access) and it turns out that this subclass closely corresponds to the Petri net model of concurrent processes